Optimizing Allocations
نویسنده
چکیده
The classical approach to allocation optimization discussed in the second part of the book assumes that the distribution of the market is known. The samplebased allocation, discussed in the previous chapter, is a two-step process: first the market distribution is estimated and then the estimate is inputted in the classical allocation optimization problem. Since this process leverages the estimation error, portfolio managers, traders and professional investors in a broader sense mistrust these two-step "optimal" approaches and prefer to resort to ad-hoc recipes, or trust their prior knowledge/experience. In this chapter we discuss allocation strategies that account for estimation risk within the allocation decision process. These strategies must be optimal according to the evaluation criteria introduced in the previous chapter: in other words, the overall opportunity cost of these strategies must be as low as possible. The main reasons why estimation risk plays such an important role in financial applications is the extreme sensitivity of the optimal allocation function to the unknown parameters that determine the distribution of the market. In Section 9.1 we use the Bayesian approach to estimation to limit this sensitivity. We present Bayesian allocations in terms of the predictive distribution of the market, as well as the classical-equivalent Bayesian allocation, which relies on Bayes-Stein shrinkage estimators of the market parameters. The Bayesian approach provides a mechanism that mixes the positive features of the prior allocation and the sample-based allocation: the estimate of the market is shrunk towards the investor’s prior in a self-adjusting way and the overall opportunity cost is reduced. In Section 9.2 we present the Black-Litterman approach to control the extreme sensitivity of the optimal allocation function to the unknown market parameters. Like the Bayesian approach, the Black-Litterman methodology makes use of Bayes’ rule. In this case the market is directly shrunk towards the investor’s prior views, rather than indirectly through the market parameters. We present the theory in a general context, performing the computations explicitly in the case of normally distributed markets. Then we apply those symmys.com
منابع مشابه
Optimizing Resource Allocations for Dynamic Interactive Applications Optimizing Resource Allocations for Dynamic Interactive Applications Abstract Optimizing Resource Allocations for Dynamic Interactive Applications
Optimizing Resource Allocations for Dynamic Interactive Applications
متن کاملOptimizing Resource Allocations for Dynamic Interactive Applications
Optimizing Resource Allocations for Dynamic Interactive Applications
متن کاملOptimizing Seasonal Firefighting Resource Allocations with Random Consequences : 4 A Stochastic Integer and Chance - Constrained Programming Estimation Approach
26
متن کاملLoss Aware Rate Allocations in H.263 Coded Video Transmissions
For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose...
متن کاملJoint design of fixed-rate source codes and multiresolution channel codes
We propose three new design algorithms for jointly optimizing source and channel codes. The joint designs combine channel-optimized vector quantization (COVQ) for the source code with rate-compatible punctured convolutional (RCPC) coding for the channel code. Our objective is to minimize the average end-to-end distortion. For a given channel SNR and transmission rate, our joint source and chann...
متن کاملA Property of Solutions to Linear Monopoly Problems
We extend the ‘no-haggling’ result of Riley and Zeckhauser (1983) to the class of linear multiproduct monopoly problems when the buyer’s valuations are smoothly distributed. In particular we show that there is no loss for the seller in optimizing over mechanisms such that all allocations belong to the boundary of the feasible set. The set of potentially optimal mechanisms can be further restric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011